Selection-based Weak Sequential Consistency Models for Distributed Shared Memory
نویسندگان
چکیده
Based on time, processor, and data selection techniques, a group of Weak Sequential Consistency models have been proposed to improve the performance of Sequential Consistency for Distributed Shared Memory. These models can guarantee Sequential Consistency for data-race-free programs that are properly labelled. This paper reviews and discusses these models in terms of their use of the selection techniques. Their programmer interfaces are also discussed and compared. Among them the View-based Consistency model is recognized as the model that can offer the maximum performance advantage among the Weak Sequential Consistency models. An implementation of the View-based Consistency model has been given. Finally this paper suggests future directions of implementation effort for Distributed Shared Memory.
منابع مشابه
A unified formalization of four shared-memory models - Parallel and Distributed Systems, IEEE Transactions on
This paper presents a shared-memory model, datarace-free-l, that unifies four earlier models: weak ordering, release consistency (with sequentially consistent special operations), the VAX memory model, and data-race-free-0. The most intuitive and commonly assumed shared-memory model, sequential consistency, limits performance. The models of weak ordering, release consistency, the VAX, and data-...
متن کاملA View-based Consistency Model based on Transparent Data Selection in Distributed Shared Memory
This paper proposes a novel View-based Consistency model for Distributed Shared Memory, in which a new concept, view, is coined. A view is a set of data objects that a processor has the right to access in the shared memory. The View-based Consistency model only requires that the data objects of a processor’s view are updated before a processor accesses them. In this way, it can achieve the maxi...
متن کاملA Practical Comparison of Cluster Operating Systems
Shared Memory is an interesting communication paradigm for SMP machines and clusters. Weak consistency models have been proposed to improve efficiency of shared memory applications. In a programming environment offering weak consistency it is a necessity to worry about individual load and store operations and about proper synchronization. In contrast to this explicit style of distributed progra...
متن کاملConsistency Model and Synchronization Primitives in SDSMS
This paper is on the general discussion of memory consistency model like Strict Consistency, Sequential Consistency, Processor Consistency, Weak Consistency etc. Then the techniques for implementing distributed shared memory Systems and Synchronization Primitives in Software Distributed Shared Memory Systems are discussed. The analysis involves the performance measurement of the protocol concer...
متن کاملDefining Uniform and Hybrid Memory Consistency Models on a Unified Framework
The behavior of Distributed Shared Memory Systems is dictated by the Memory Consistency Model. Several Memory Consistency Models have been proposed in the literature and they fit basically in two categories: uniform and hybrid models. To provide a better understanding on the semantics of the memory models, researchers have proposed formalisms to define them. Unfortunately, most of the work has ...
متن کامل